A Faster Algorithm for Computing the Link Distance Between Two Point Sets on the Real Line
نویسندگان
چکیده
Let S and T be point sets with |S| ≥ |T | and total cardinality n. A linking between S and T is a matching, L, between the sets where every element of S and T is matched to at least one element of the other set. The link distance is defined as the minimum-cost linking. In this note we consider a special case of the link distance where both point sets lie on the real line and the cost of matching two points is the distance between them in the L1 metric. An O(n2) algorithm for this problem is presented, improving the previous best known complexity of O(n3).
منابع مشابه
Faster Algorithms for Computing Distances between One-Dimensional Point Sets
Let S and T be two finite sets of points on the real line with |S| + |T | = n and |S| > |T |. We consider two distance measures between S and T that have applications in music information retrieval and computational biology: the surjection distance and the link distance. The former is called the restriction scaffold assignment problem in computational biology, and assigns each point of S to a p...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملمدلسازی صفحهای محیطهای داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملA Novel Algorithm for Digital Distance Relaying
Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...
متن کامل